YES 0.433 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



↳ HASKELL
  ↳ LR

mainModule Main
  ((primExitWith :: Int  ->  IO a) :: Int  ->  IO a)

module Main where
  import qualified Prelude


Lambda Reductions:
The following Lambda expression
\fs→Hugs_ExitWith c

is transformed to
primExitWith0 c f s = Hugs_ExitWith c



↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR

mainModule Main
  ((primExitWith :: Int  ->  IO a) :: Int  ->  IO a)

module Main where
  import qualified Prelude


Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR

mainModule Main
  ((primExitWith :: Int  ->  IO a) :: Int  ->  IO a)

module Main where
  import qualified Prelude


Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
            ↳ HASKELL
              ↳ Narrow

mainModule Main
  (primExitWith :: Int  ->  IO a)

module Main where
  import qualified Prelude


Haskell To QDPs